Regular omega-languages and finite monoids having infinite products.
نویسندگان
چکیده
منابع مشابه
Learning Regular Omega Languages
We provide an algorithm for learning an unknown regular set of infinite words, using membership and equivalence queries. Three variations of the algorithm learn three different canonical representations of omega regular languages, using the notion of families of dfas. One is of size similar to L$, a dfa representation recently learned using L ∗ [7]. The second is based on the syntactic forc, in...
متن کاملP Finite Automata and Regular Languages over Countably Infinite Alphabets
We examine the class of languages over countably infinite alphabets characterized by a class of restricted and simplified P automata variants, which we call P finite automata, and show that these classes possess several properties which make them perfect candidates for being the natural extension of the notion of finite automata and that of regular languages to infinite alphabets. To this aim, ...
متن کاملMonitorability of omega-regular languages
Arguably, ω-regular languages play an important rôle as a specification formalism in many approaches to systems monitoring via runtime verification. However, since their elements are infinite words, not every ω-regular language can sensibly be monitored at runtime when only a finite prefix of a word, modelling the observed system behaviour so far, is available. The monitorability of an ω-regula...
متن کاملWeak $\omega$-Regular Trace Languages
Mazurkiewicz traces describe concurrent behaviors of distributed systems. Trace-closed word languages, which are “linearizations” of trace languages, constitute a weaker notion of concurrency but still give us tools to investigate the latter. In this vein, our contribution is twofold. Firstly, we develop definitions that allow classification of ω-regular trace languages in terms of the correspo...
متن کاملIdentifying Regular Languages over Partially-Commutative Monoids
We deene a new technique useful in identifying a subclass of regular languages deened on a free partially commutative monoid (regular trace languages), using equivalence and membership queries. Our algorithm extends an algorithm deened by Dana Angluin in 1987 to learn DFA's. The words of a trace language can be seen as equivalence classes of strings. We show how to extract, from a given equival...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science and Cybernetics
سال: 2012
ISSN: 1813-9663,1813-9663
DOI: 10.15625/1813-9663/19/2/1512